Partitionable Light-Weight Groups
نویسندگان
چکیده
Group communication, providing virtual synchrony semantics, is a powerful paradigm for building distributed applications. For applications that require a large number of groups, signi cant performance gains can be attained if these groups share the resources required to provide virtual synchrony. A service that maps multiple user groups onto a small number of instances of a virtually synchronous implementation is called a Light-Weight Group Service. This paper describes the design of a light-weight group service able to operate in partitionable networks. Partitions pose challenges to the design of this service, in particular because inconsistent mapping decisions can be made when the system is partitioned. The paper focuses on the design of reconciliation mechanisms needed when a partition is healed.
منابع مشابه
Relying on Safe Distance to Achieve Strong Partitionable Group Membership in Ad Hoc Networks
The design of ad hoc mobile applications often requires the availability of a consistent view of the application state among the participating hosts. Such views are important because they simplify both the programming and verification tasks. We argue that preventing the occurrence of unannounced disconnection is essential to constructing and maintaining a consistent view in the ad hoc mobile en...
متن کاملPartitionable graphs arising from near-factorizations of finite groups
In 1979, two constructions for making partitionable graphs were introduced in (by Chv2 atal et al. (Ann. Discrete Math. 21 (1984) 197)). The graphs produced by the second construction are called CGPW graphs. A near-factorization (A; B) of a %nite group is roughly speaking a non-trivial factorization of G minus one element into two subsets A and B. Every CGPW graph with n vertices turns out to b...
متن کاملThe Jgroup Reliable Distributed Object Model
This paper presents the design and the implementation of Jgroup, an extension of the Java distributed object model based on the group communication paradigm. Aim of Jgroup is to support the development of dependable applications in partitionable distributed systems. Jgroup consists of a partitionable group communication service that simplifies the cooperation among groups of replicated server o...
متن کاملA "Generalized k-Tree-Based Model to Sub-system Allocation" for Partitionable Multi-dimensional Mesh-Connected Architectures
This paper presents a new processor allocation approach called “a generalized k-Tree-based model” to perform dynamic sub-system allocation/deallocation decision for partitionable multi-dimensional mesh-connected architectures. Time complexity of our generalized k-tree-based sub-system allocation algorithm is O(k42k(NA+NF)+k 2) for the partitionable k-D meshes and O(NA+NF) for the partitionable ...
متن کاملRecursive generation of partitionable graphs
Results of Lovász (1972) and Padberg (1974) imply that partitionable graphs contain all the potential counterexamples to Berge’s famous Strong Perfect Graph Conjecture. A recursive method of generating partitionable graphs was suggested by Chvátal, Graham, Perold and Whitesides (1979). Results of Sebő (1996) entail that Berge’s conjecture holds for all the partitionable graphs obtained by this ...
متن کامل